An Optimal Stability Matching Algorithm for DAG Blockchain Based on Matching Theory

IOTA is a typical blockchain designed for IoT applications. The Markov chain monte carlo algorithm (MCMC) used in may lead to large number of unverified blocks, which increases transaction delay certain extent. We propose Stable matching (SMA) based on theory stimulate nodes verify thereby reducing the blocks and consensus delay. structure our uses Directed acyc1ic graph (DAG) improve processing capability. network are abstracted as issuers verifiers. A verification service scheduling system assign transactions verifiers achieve optimal matching. trust evaluation mechanism offers references awards check transactions. simulation results show that SMA can significantly reduce orphan throughput, helps reliability blockchain.